Efficient visit frequencies for polling tables: minimization of waiting cost

Multiple-Valued Logic Minimization using Universal Literals and Cost Tables

We propose a minimization algorithm that combines cost tables and simulated annealing. Unlike other minimization procedures that use cost tables, our method does not rely on the enumeration of all minterms, it works directly with the expression (a sum of product terms). We tested our method with a cost table obtained from current mode CMOS. The algorithm can be readily adapted to any other tech...

Waiting Time Variance in Polling Systems

In this paper, we develop a general expression for the second moment of waiting time for polling systems with either an exhaustive or gated service policy. We obtain a closed form expression for the second moment of waiting time for the special case of systems with two identical stations. This result is used to show that the behavior of the first two moments can be very different. Specifically,...

Dynamic visit-order rules for batch-service polling

Closed-Form Waiting Time Approximations for Polling Systems

A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focusses on Poisson arrivals, whereas very few results are available for general arrivals. The current study is the first one presenting simple closed-form approximations for the mean waiting times in polling systems with renewal arrival processes...

Study on the Cost-Effectiveness of a Probe Vehicle System at Lower Polling Frequencies

Kai Liu Toshiyuki Yamamoto *2 Taka Morikawa *3 Graduate School of Civil Engineering, Kobe University *1 (1-1, Rokkodai, Nada, Kobe City, Japan, 657-8501, +81-78-803-6436, [email protected]) Department of Civil Engineering, Nagoya University *2 (Furo, Chikusa, Nagoya City, Japan, 464-8603, +81-52-789-4636, [email protected]) Department of Environmental Engineering and Arc...